Another H-super magic decompositions of the lexicographic product of graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

H-E-Super magic decomposition of graphs

An H-magic labeling in an H-decomposable graph G is a bijection f : V (G)∪E(G)→ {1, 2, . . . , p+ q} such that for every copy H in the decomposition, ∑ v∈V (H) f(v)+ ∑ e∈E(H) f(e) is constant. The function f is said to be H-E-super magic if f(E(G)) = {1, 2, . . . , q}. In this paper, we study some basic properties of m-factor-E-super magic labeling and we provide a necessary and sufficient cond...

متن کامل

Mixed cycle-E-super magic decomposition of complete bipartite graphs

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) +  ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...

متن کامل

Mixed cycle-E-super magic decomposition of complete bipartite graphs

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...

متن کامل

Lexicographic Product of Extendable Graphs

Lexicographic product G◦H of two graphs G and H has vertex set V (G)×V (H) and two vertices (u1, v1) and (u2, v2) are adjacent whenever u1u2 ∈ E(G), or u1 = u2 and v1v2 ∈ E(H). If every matching of G of size k can be extended to a perfect matching in G, then G is called k-extendable. In this paper, we study matching extendability in lexicographic product of graphs. The main result is that the l...

متن کامل

Identifying Codes of Lexicographic Product of Graphs

Let G be a connected graph and H be an arbitrary graph. In this paper, we study the identifying codes of the lexicographic product G[H] of G and H. We first introduce two parameters of H, which are closely related to identifying codes of H. Then we provide the sufficient and necessary condition for G[H] to be identifiable. Finally, if G[H] is identifiable, we determine the minimum cardinality o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indonesian Journal of Combinatorics

سال: 2018

ISSN: 2541-2205

DOI: 10.19184/ijc.2018.2.2.2